Smooth Analysis of the Condition Number and the Least Singular Value

نویسندگان

  • Terence Tao
  • Van H. Vu
چکیده

Let x be a complex random variable with mean zero and bounded variance. Let Nn be the random matrix of size n whose entries are iid copies of x and let M be a fixed matrix of the same size. The goal of this paper is to give a general estimate for the condition number and least singular value of the matrix M +Nn, generalizing an earlier result of Spielman and Teng for the case when x is gaussian. Our investigation reveals an interesting fact that the “core” matrix M does play a role on tail bounds for the least singular value of M+Nn. This does not occur in Spielman-Teng studies when x is gaussian. Consequently, our general estimate involves the norm ‖M‖. In the special case when ‖M‖ is relatively small, this estimate is nearly optimal and extends or refines existing results.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Noise Effects on Modal Parameters Extraction of Horizontal Tailplane by Singular Value Decomposition Method Based on Output Only Modal Analysis

According to the great importance of safety in aerospace industries, identification of dynamic parameters of related equipment by experimental tests in operating conditions has been in focus. Due to the existence of noise sources in these conditions the probability of fault occurrence may increases. This study investigates the effects of noise in the process of modal parameters identification b...

متن کامل

Graph Clustering by Hierarchical Singular Value Decomposition with Selectable Range for Number of Clusters Members

Graphs have so many applications in real world problems. When we deal with huge volume of data, analyzing data is difficult or sometimes impossible. In big data problems, clustering data is a useful tool for data analysis. Singular value decomposition(SVD) is one of the best algorithms for clustering graph but we do not have any choice to select the number of clusters and the number of members ...

متن کامل

ar X iv : 0 80 5 . 31 67 v 2 [ m at h . PR ] 1 0 A ug 2 00 9 SMOOTH ANALYSIS OF THE CONDITION NUMBER AND THE LEAST SINGULAR VALUE

Let x be a complex random variable with mean zero and bounded variance. Let Nn be the random matrix of size n whose entries are iid copies of x and M be a fixed matrix of the same size. The goal of this paper is to give a general estimate for the condition number and least singular value of the matrix M + Nn, generalizing an earlier result of Spielman and Teng for the case when x is gaussian. O...

متن کامل

A finite difference method for the smooth solution of linear Volterra integral equations

The present paper proposes a fast numerical method for the linear Volterra integral equations withregular and weakly singular kernels having smooth solutions. This method is based on the approx-imation of the kernel, to simplify the integral operator and then discretization of the simpliedoperator using a forward dierence formula. To analyze and verify the accuracy of the method, weexamine samp...

متن کامل

A contribution to the conditioning of the total least squares problem

We derive closed formulas for the condition number of a linear function of the total least squares solution. Given an over determined linear system Ax = b, we show that this condition number can be computed using the singular values and the right singular vectors of [A, b] and A. We also provide an upper bound that requires the computation of the largest and the smallest singular value of [A, b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Math. Comput.

دوره 79  شماره 

صفحات  -

تاریخ انتشار 2009